Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
نویسندگان
چکیده
One-way accumulators, introduced by Benaloh and de Mare, can be used to accumulate a large number of values into a single one, which can then be used to authenticate every input value without the need to transmit the others. However, the one-way property does is not suucient for all applications. In this paper, we generalize the deenition of accumulators and deene and construct a collision-free subtype. As an application, we construct a fail-stop signature scheme in which many one-time public keys are accumulated into one short public key. In contrast to previous constructions with tree authentication, the length of both this public key and the signatures can be independent of the number of messages that can be signed.
منابع مشابه
Fail-Stop Signatures Without Trees
We construct the first fail-stop signature scheme where neither the signature length nor the length of the public key grows as a function of the number of messages that can be signed with one key. The computation needed for signing and testing is reduced similarly. This removes one of the main differences between the complexity of ordinary signature schemes and previous fail-stop signature sche...
متن کاملSignatures dont des falsifications sont prouvables , et leur application – – – – – – – – Fail - stop Signatures and their Application
The unforgeability of conventional digital signatures is necessarily based on complexity theoretic assumptions, i.e. even the most secure schemes can be broken by an adversary with unexpected computing abilities. Thus we introduce fail-stop signatures: They are as unforgeable as the best conventional signatures, but if a signature is forged nevertheless, the supposed signer can prove the forger...
متن کاملRedactable Signature Schemes for Trees With Signer-Controlled Non-Leaf-Redactions
Redactable signature schemes (RSS) permit to remove parts from signed documents, while the signature remains valid. Some RSSs for trees allow to redact non-leaves. Then, new edges have to be added to the tree to preserve it’s structure. This alters the position of the nodes’ children and may alter the semantic meaning encoded into the tree’s structure. We propose an extended security model, whe...
متن کاملAn Efficient Fail-Stop Signature Scheme Based on Factorization
Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. In this paper, we show a flaw in a previously proposed fail-stop signature that is based on the difficulty of factorization, and then describe a secure scheme based on the same assumption.
متن کاملEfficient Fail-Stop Signatures from the Factoring Assumption
In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in which signers are protected through a computational conjecture, fail-stop signature schemes protect the signers in an information theoretic sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997